Rational approximation formulas for computing the positive zeros of J0(x)
نویسندگان
چکیده
منابع مشابه
On computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملError formulas for multivariate rational interpolation and Pad6 approximation
The univariate error formulas for Pad6 approximants and rational interpolants, which are repeated in Section 2, are generalized to the multivariate case in Section 4. We deal with "general order" multivariate Pad~ approximants and rational interpolants, where the numerator and denominator polynomials as well as the equations expressing the approximation order, can be chosen by the user of these...
متن کاملRational Approximation on the Positive Real Axis
Introduction Rational Chebyshev approximation to reciprocals of certain entire functions by reciprocals of polynomials on the positive real axis has recently attracted the attention of many mathematicians . By developing certain new methods of approach we successfully attacked ([3]-[6]) some of the related problems . This paper is a continuation of our earlier papers ([3]-[6] ) . The results of...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملComputing rational Gauss-Chebyshev quadrature formulas with complex poles
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary complex poles outside [−1, 1]. This algorithm is based on the derivation of explicit expressions for the Chebyshev (para-)orthogonal rational functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(95)00219-7